DC-free binary convolutional coding

نویسندگان

  • Tadashi Wadayama
  • A. J. Han Vinck
چکیده

A novel DC-free binary convolutional coding scheme is presented. The proposed scheme achieves the DC-free and error correcting capability simultaneously. The scheme has a simple cascaded structure of the RDS(running digital sum) control encoder and the conventional convolutional encoder. A given sequence becomes DC-free if and only if the absolute RDS value of the sequence is bounded by a constant for any time instant. The RDS control encoder generates a sequence which gives the convolutional coded sequence with a bounded RDS value. The structure allows us to exploit efficient soft decision decoding which attains additional coding gains compared with hard decision decoding over an additive white Gaussian noise(AWGN) channel. Bounds on the RDS value are explicitly established for the proposed scheme. By using the bounds, we have performed computer searches for finding good RDS control encoders. The proposed scheme provides wide varieties of reasonable tradeoffs between the coding gain, the RDS constraint, and decoding complexity. For example, a 64-state DC-free coding scheme with the overall rate 6/16 and the minimum free distance 10 has been obtained. This scheme satisfies a bounded RDS constraint(from −18 to +18) and it yields a considerably high asymptotic coding gain(over an AWGN channel) of 5.7 dB. Keywords— DC-free coding, Convolutional code, Additive encoding.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Variable-complexity trellis decoding of binary convolutional codes

We consider trellis decoding of convolutional codes with selectable effort, as measured by decoder complexity. Decoding is described for single parent codes with a variety of complexities, with performance “near” that of the optimal fixed receiver complexity coding system. Effective free distance is examined. Criteria are proposed for ranking parent codes, and some codes found to be best accord...

متن کامل

Quantum Convolutional Coding

We show how to protect a stream of quantum information from decoherence induced by a noisy quantum communication channel. We exploit preshared entanglement and a convolutional coding structure to develop a theory of entanglementassisted quantum convolutional coding. Our construction produces a Calderbank-Shor-Steane (CSS) entanglement-assisted quantum convolutional code from two arbitrary class...

متن کامل

Entanglement-Assisted Quantum Convolutional Coding

We show how to protect a stream of quantum information from decoherence induced by a noisy quantum communication channel. We exploit preshared entanglement and a convolutional coding structure to develop a theory of entanglement-assisted quantum convolutional coding. Our construction produces a Calderbank-Shor-Steane (CSS) entanglement-assisted quantum convolutional code from two arbitrary clas...

متن کامل

Multi-level Coding and Multi-stage Decoding for Modulations with Hexagonal Constellation

M-ary Modulation and convolutional encoder are commonly employed in modern wireless systems; the modulation has rectangular constellation and square decision regions, and the encoder is binary based. However, we have demonstrated previously that modulations with hexagonal decision regions are more energy efficient transmission. And we have introduced a system which is compatible with binary dat...

متن کامل

WLAN and Bluetooth Coexistence: A Comparative Study of Convolutional Coding versus Turbo Coding

The IEEE 802.11g physical layer is based on coded orthogonal frequency division multiplexing (COFDM) using the industry standard [133 171] binary convolutional code. In the presence of Bluetooth interference this code struggles to provide good packet error rate (PER) performance. In this paper Turbo coding is considered as an alternative to convolutional coding. The results show that Turbo codi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 48  شماره 

صفحات  -

تاریخ انتشار 2002